Complexity issues on bounded restrictive H-coloring
نویسندگان
چکیده
We consider a bounded version of the restrictive and the restrictive list H-coloring problem in which the number of pre-images of certain vertices of H is taken as parameter. We consider the decision and the counting versions, as well as, further variations of those problems. We provide complexity results identifying the cases when the problems are NP-complete or #P-complete or polynomial time solvable. We conclude stating some open problems. © 2006 Elsevier B.V. All rights reserved.
منابع مشابه
The restrictive H-coloring problem
We define a variant of the H-coloring problem where the number of preimages of certain vertices is predetermined as part of the problem input. We consider the decision and the counting version of the problem, namely the restrictive H-coloring and the restrictive #H-coloring problems, and we provide a dichotomy theorem determining the H’s for which the restrictive H-coloring problem is either NP...
متن کاملSmall H-Coloring Problems for Bounded Degree Digraphs
An NP-complete coloring or homomorphism problem may become polynomial time solvable when restricted to graphs with degrees bounded by a small number, but remain NP-complete if the bound is higher. For instance, 3-colorability of graphs with degrees bounded by 3 can be decided by Brooks’ theorem, while for graphs with degrees bounded by 4, the 3-colorability problem is NP-complete. We investigat...
متن کاملOptimal Data Reduction for Graph Coloring Using Low-Degree Polynomials
The theory of kernelization can be used to rigorously analyze data reduction for graph coloring problems. Here, the aim is to reduce a q-Coloring input to an equivalent but smaller input whose size is provably bounded in terms of structural properties, such as the size of a minimum vertex cover. In this paper we settle two open problems about data reduction for q-Coloring. First, we obtain a ke...
متن کاملOn the complexity of $\mathbb H$-coloring for special oriented trees
For a fixed digraph H, the H-coloring problem is the problem of deciding whether a given input digraph G admits a homomorphism to H. The CSP dichotomy conjecture of Feder and Vardi is equivalent to proving that, for any H, the H-coloring problem is in in P or NP-complete. We confirm this dichotomy for a certain class of oriented trees, which we call special trees (generalizing earlier results o...
متن کاملDeposited in DRO : 17
A homomorphism from a graph G to a graph H is a vertex mapping f : VG → VH such that f(u) and f(v) form an edge in H whenever u and v form an edge in G. The H-Coloring problem is to test if a graph G allows a homomorphism to a given graph H. A well-known result of Hell and Nešetřil determines the computational complexity of this problem for any fixed graph H. We study a natural variant of this ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 307 شماره
صفحات -
تاریخ انتشار 2007